Auflistung nach Schlagwort "Computer circuits"

Sortiert nach: Sortierung: Ergebnisse:

  • Axiomatizations for propositional and modal team logic 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016)
    A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic ...
  • Axiomatizing propositional dependence logics 
    Sano, Katsuhiko; Virtema, Jonni (Wadern : Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, 2015)
    We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional ...
  • Backdoors for linear temporal logic 
    Meier, Arne; Ordyniak, Sebastian; Sridharan, Ramanujan; Schindler, Irena (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017)
    In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of the satisfiability problem parameterized ...
  • Canonical models and the complexity of modal team logic 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We study modal team logic MTL, the team-semantical extension of classical modal logic closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, ...
  • A cryogenic radio-frequency ion trap for quantum logic spectroscopy of highly charged ions 
    Leopold, T.; King, S.A.; Micke, P.; Bautista-Salvador, A.; Heip, J.C.; Ospelkaus, C.; Crespo López-Urrutia, J.R.; Schmidt, P.O. ([Erscheinungsort nicht ermittelbar] : American Institute of Physics, 2019)
    A cryogenic radio-frequency ion trap system designed for quantum logic spectroscopy of highly charged ions (HCI) is presented. It includes a segmented linear Paul trap, an in-vacuum imaging lens, and a helical resonator. ...
  • Decidability of predicate logics with team semantics 
    Kontinen, Juha; Kuusisto, Antti; Virtema, Jonni (Saarbrücken : Dagstuhl Publishing, 2016)
    We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIMEcomplete. Furthermore, we show that the ...
  • Descriptive complexity of #AC0 functions 
    Durand, Arnaud; Haak, Anselm; Kontinen, Juha; Vollmer, Heribert (Saarbrücken : Dagstuhl Publishing, 2016)
    We introduce a new framework for a descriptive complexity approach to arithmetic computations. We define a hierarchy of classes based on the idea of counting assignments to free function variables in first-order formulae. ...
  • Model checking and validity in propositional and modal inclusion logics 
    Hella, Lauri; Kuusisto, Antti; Meier, Arne; Virtema, Jonni (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017)
    Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity ...
  • On quantified propositional logics and the exponential time hierarchy 
    Hannula, Miika; Kontinen, Juha; Lück, Martin; Virtema, Jonni (Waterloo, NSW : Open Publishing Association, 2016)
    We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified ...
  • On the complexity of team logic and its two-variable fragment 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We study the logic FO(∼), the extension of first-order logic with team semantics by unrestricted Boolean negation. It was recently shown to be axiomatizable, but otherwise has not yet received much attention in questions ...
  • On the implicit graph conjecture 
    Chandoo, Maurice (Saarbrücken : Dagstuhl Publishing, 2016)
    The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label ...
  • Parametrised complexity of satisfiability in temporal logic 
    Lück, Martin; Meier, Arne; Schindler, Irena (Association for Computing Machinery, 2017)
    We apply the concept of formula treewidth and pathwidth to computation tree logic, linear temporal logic, and the full branching time logic. Several representations of formulas as graphlike structures are discussed, and ...
  • Quantum Algorithmic Readout in Multi-Ion Clocks 
    Schulte, M.; Lörch, N.; Leroux, I.D.; Schmidt, Piet O.; Hammerer, K. (College Park, MD : American Physical Society, 2016)
    Optical clocks based on ensembles of trapped ions promise record frequency accuracy with good short-term stability. Most suitable ion species lack closed transitions, so the clock signal must be read out indirectly by ...
  • Risk analysis with a fuzzy-logic approach of a complex installation 
    Peikert, Tim; Garbe, Heyno; Potthast, S. (Göttingen : Copernicus GmbH, 2016)
    This paper introduces a procedural method based on fuzzy logic to analyze systematic the risk of an electronic system in an intentional electromagnetic environment (IEME). The method analyzes the susceptibility of a complex ...
  • Team semantics for the specification and verification of hyperproperties 
    Krebs, Andreas; Meier, Arne; Virtema, Jonni; Zimmermann, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2018)
    We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an ...
  • A van Benthem theorem for modal team semantics 
    Kontinen, Juha; Müller, Julian-Steffen; Schnoor, Henning; Vollmer, Heribert (Wadern : Schloss Dagstuhl- Leibniz-Zentrum für Informatik GmbH, 2015)
    The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework ...